State representations of convolutional codes over a finite ring

نویسندگان

چکیده

In this paper we study finite support convolutional codes over Zpr by means of an input-state-output representation. We show that the set weight trajectories associated to type representations has structure a Zpr-submodule Zprn and therefore is (finite support) code. Fundamental system-theoretical properties such as observability, reachability or minimality, are investigated in context.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

متن کامل

Linear representations of convolutional codes over rings

In this paper we extend the relation between convolutional codes and linear systems over finite fields to certain commutative rings through first order representations . We introduce the definition of rings with representations as those for which these representations always exist, and we show that finite products of finite fields belong to this class. We develop the input/state/output represen...

متن کامل

Minimal Trellis Construction for Finite Support Convolutional Ring Codes

We address the concept of “minimal polynomial encoder” for finite support linear convolutional codes over Zpr . These codes can be interpreted as polynomial modules which enables us to apply results from the 2007-paper [8] to introduce the notions of “p-encoder” and “minimal p-encoder”. Here the latter notion is the ring analogon of a row reduced polynomial encoder from the field case. We show ...

متن کامل

Input-state-output representations and constructions of finite support 2D convolutional codes

Two-dimensional convolutional codes are considered with code sequences having compact support indexed in N2 and taking values in Fn , where F is a finite field. Input-state-output representations of these codes are introduced and several aspects of such representations are discussed. Constructions of such codes with a designed distance are also presented.

متن کامل

Quantum codes over a class of finite chain ring

In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F2 [u] / (u) to F s 2 where F2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F2 [u] / (u) . By taking advantage of this Gray map and the structure of the ring, we obtain two classes of binary quantum ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2022

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2021.12.006